A Logic for Reasoning Equationally in the Presence of Partiality

نویسندگان

  • Joseph M. Morris
  • Alexander Bunkenburg
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partiality, State and Dependent Types

Partial type theories allow reasoning about recursively-defined computations using fixed-point induction. However, fixed-point induction is only sound for admissible types and not all types are admissible in sufficiently expressive dependent type theories. Previous solutions have either introduced explicit admissibility conditions on the use of fixed points, or limited the underlying type theor...

متن کامل

Decision Procedures for Equationally Based Reasoning

This work develops new automated reasoning techniques for verifying the correctness of equationally specified programs. These techniques are not just theoretical, but have been implemented, and applied to actual program verification projects. Although the work spans several different areas, a major theme of this work is to develop better techniques at the boundary between decidable and undecida...

متن کامل

Hyper Normalisation and Conditioning for Discrete Probability Distributions

Normalisation in probability theory turns a subdistribution into a proper distribution. It is a partial operation, since it is undefined for the zero subdistribution. This partiality makes it hard to reason equationally about normalisation. A novel description of normalisation is given as a mathematically well-behaved total function. The output of this ‘hyper’ normalisation operation is a distr...

متن کامل

Reasoning without Believing { on the Mechanization of Presuppositions and Partiality Reasoning without Believing: on the Mechanization of Presuppositions and Partiality

It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical rst-order logic. In this paper we address two of the problems, rstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of parti...

متن کامل

Reasoning without Believing: on the Mechanization of Presuppositions and Partiality on the Mechanization of Presuppositions and Partiality

It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical rst-order logic. In this paper we address two of the problems, rstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 34  شماره 

صفحات  -

تاریخ انتشار 1999